Buffer Automata
نویسندگان
چکیده
We introduce an architectural software formalism, buffer automata, for the specification, implementation and analysis of a particular class of discrete interactive systems and devices. The approach defines a layer between the physical user interface and the application (if any) and provides a clear framework for highlighting a number of interaction design issues, in particular around modes and undo.
منابع مشابه
Deterministic Autopoietic Automata
In 2001, van Leeuwen and Wiedermann [1] have defined evolving interactive systems, in particular sequences of interactive finite automata with global states, to model infinite computations on an ever changing machine or system of machines. Modern computation does not just happen on an individual machine for a fixed time, but it goes on forever over an unbounded number of software and hardware c...
متن کاملMulti-Buffer Simulations for Trace Language Inclusion
We consider simulation games played between Spoiler and Duplicator on two Büchi automata in which the choices made by Spoiler can be buffered by Duplicator in several buffers before she executes them on her structure. We show that the simulation games are useful to approximate the inclusion of trace closures of languages accepted by finite-state automata, which is known to be undecidable. We st...
متن کاملOptimal Buffer Allocation in Production Lines Using an Automata Search
In this paper, we use a learning automata search technique (LAST), which is based on game theory, to solve the optimal buffer allocation problem in production lines. We have incorporated the search algorithm within a simulator in order to optimize the performance of a production line. We have conducted experiments with this algorithm on some problems for which optimal solutions are available in...
متن کاملAn Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models
This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relaxation, which corresponds to the use of store buffers. The proposed approach proceeds by using finite automata to symbolically represent the possible contents of the store buffers. Store, load and commit operations then...
متن کاملInterface Automata and Actif Actors
This technical note uses the Ptolemy II interface automaton editor to compose networks of dataflow actors and buffers. The automata are first described as Actif actors; the composition of the automata together with a controller automata reveals the combined behavior of the network. This technical note can be referenced as: “Interface Automata and Actif Actors,” H John Reekie, UC Berkeley, Novem...
متن کامل